Signal-Aware Route Planning
نویسندگان
چکیده
Modern vehicles have an increasing number of advanced features requiring network coverage in order to function properly. In order to facilitate the requirements of such features and allow more advanced applications, we consider the possibility of planning routes that take signal strength into consideration. Previous work have shown the relationship between TCP throughput/goodput and signal strength. In this thesis signal-aware route planning is presented, implemented, and validated. Crowd-sourced map and signal data (3G) from two sources is used for building a signal coverage map. The signal and map data is validated in a field experiment, where routes were travelled while measuring the signal strength. The field experiment showed gains in signal characteristics when deviating from the shortest possible path. The average signal strength increased by 11 dBm between algorithms and the shortest possible path. Lastly, routes were planned for all possible sources and destinations in a given urban area. The results of this calculation confirms the patterns found in the field experiment.
منابع مشابه
Planning Plausible Human Animation with Environment-Aware Motion Sampling
The creation of plausible human animation remains a perennial problem in computer graphics. To construct long animations it is common to stitch together a sequence of motions from a motion database. Typically, this is done in two stages: planning a route and then sampling motions from the database to follow that route. We introduce an environment-aware motion sampling technique that combines th...
متن کاملSelf-Aware Traffic Route Planning
One of the most ubiquitous AI applications is vehicle route planning. While state-of-the-art systems take into account current traffic conditions or historic traffic data, current planning approaches ignore the impact of their own plans on the future traffic conditions. We present a novel algorithm for self-aware route planning that uses the routes it plans for current vehicle traffic to more a...
متن کاملComparing context-aware routing and local intersection management
In multi-agent routing, there is a set of mobile agents each with a start location and destination location on a shared infrastructure. An agent wants to reach his destination as quickly as possible, but conflicts with other agents must be avoided. We have previously developed a single-agent route planning algorithm that can find a shortest-time route that does not conflict with any previously ...
متن کاملContext-Aware Route Planning
In context-aware route planning, there is a set of transportation agents each with a start and destination location on a shared infrastructure. Each agent wants to find a shortest-time route plan without colliding with any of the other agents, or ending up in a deadlock situation. We present a single-agent route planning algorithm that is both optimal and conflict-free. We also present a set of...
متن کاملQoS-aware multihop routing in wireless sensor networks with power control using demodulation-and-forward protocol
In this article, we propose a low-complexity joint power allocation and route planning algorithm for multiple antennas wireless sensor networks using dynamic programming. The sensor nodes utilize orthogonal space time block codes with demodulation-and-forward protocol. Unlike the previous work which typically optimize all the parameters, we cast this Quality-of-Service aware packet forwarding p...
متن کامل